#include<bits/stdc++.h>
using namespace std;
int a[100005];
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    int n;
    cin>>n;
    for(int i=1; i<=n; i++){
        scanf("%d",&a[i]);
    }
    sort(a+1,a+n+1);
    int b=1;
    vector<int> E;
    for(int i=2; i<=n; i++){
        if(a[i]!=a[i-1]){
            E.push_back(b);
            b=1;
        }
        else b++;
    }
    E.push_back(b);
    int ans=n;
    for(int i=1; i<E.size(); i++){
        ans-=min(E[i],E[i-1]);
        E[i]=max(E[i],E[i-1]);
    }
    cout<<ans;
    return 0;
}
